FPT algorithms and kernels for the Directed k-Leaf problem
نویسندگان
چکیده
منابع مشابه
FPT Algorithms and Kernels for the Directed $k$-Leaf Problem
A subgraph T of a digraph D is an out-branching if T is an oriented spanning tree with only one vertex of in-degree zero (called the root). The vertices of T of out-degree zero are leaves. In the Directed Max Leaf Problem, we wish to find the maximum number of leaves in an out-branching of a given digraph D (or, to report that D has no out-branching). In the Directed k-Leaf Problem, we are give...
متن کاملAn FPT Algorithm for Directed Spanning k-Leaf
An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given digraph D has an out-branching with at least k leaves (Directed Spanning k-Leaf). We prove that this problem is fixed parameter tractable, when k is chosen as the parameter. Previously this was only known for restricted classes of dire...
متن کاملDirected Feedback Vertex Set Problem is FPT
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long time open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is fixed-parameter tractable and give the first FPT algorithm of running time O((1.48k)n) for it. As the feedback arc set problem in directed graph can be transformed to a feedb...
متن کاملExperimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem
In this experimental study we evaluate the performance of a recent fixed parameter tractable (FPT) algorithm for the directed feedback node set problem (DFVS) by Chen et al. Lacking suitable real world data, all tests are performed on random graphs. To speed up the FPT algorithm we propose several new data reduction rules for DFVS, and then use various heuristics to accelerate the FPT search. O...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2010
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2009.06.005